symmetric representation - tradução para russo
Diclib.com
Dicionário ChatGPT
Digite uma palavra ou frase em qualquer idioma 👆
Idioma:

Tradução e análise de palavras por inteligência artificial ChatGPT

Nesta página você pode obter uma análise detalhada de uma palavra ou frase, produzida usando a melhor tecnologia de inteligência artificial até o momento:

  • como a palavra é usada
  • frequência de uso
  • é usado com mais frequência na fala oral ou escrita
  • opções de tradução de palavras
  • exemplos de uso (várias frases com tradução)
  • etimologia

symmetric representation - tradução para russo

Representations of S N; Representations of the symmetric group; Representation of the symmetric groups; Symmetric group representation theory; Permutation representation (symmetric group); Representation theory of the symmetric and alternating groups; Representation theory of symmetric groups
  • The [[compound of five tetrahedra]], on which A<sub>5</sub> acts, giving a 3-dimensional representation.

symmetric representation      

математика

симметрическое представление

symmetric cryptography         
ALGORITHM
Symmetric Algorithms; Symmetric key; Symmetric encryption; Symmetric key cryptography; Symmetric cypher; Shared key; Symmetric cipher; Symmetric-key cipher; Symmetric key algorithms; Symmetric cryptography; Private-key cryptography; Symmetric key encryption; Symmetric key algorithm; Reciprocal cipher; Reciprocal encipherment; Private key cryptography; Symmetric-key encryption algorithm; Symmetric-key cryptography; Private-key; Symmetric algorithm; Private-key encryption; Symmetrical encryption

общая лексика

криптография с симметричными шифрами

использует один и тот же секретный ключ для операций шифрования и дешифрования

Смотрите также

symmetric cipher

private key cryptography         
ALGORITHM
Symmetric Algorithms; Symmetric key; Symmetric encryption; Symmetric key cryptography; Symmetric cypher; Shared key; Symmetric cipher; Symmetric-key cipher; Symmetric key algorithms; Symmetric cryptography; Private-key cryptography; Symmetric key encryption; Symmetric key algorithm; Reciprocal cipher; Reciprocal encipherment; Private key cryptography; Symmetric-key encryption algorithm; Symmetric-key cryptography; Private-key; Symmetric algorithm; Private-key encryption; Symmetrical encryption
(classical cryptography) классическая (традиционная) криптография, одноключевая криптография

Definição

symmetric key cryptography
<cryptography> A cryptography system in which both parties have the same encryption key, as in {secret key cryptography}. Opposite: public-key cryptography. (1998-06-09)

Wikipédia

Representation theory of the symmetric group

In mathematics, the representation theory of the symmetric group is a particular case of the representation theory of finite groups, for which a concrete and detailed theory can be obtained. This has a large area of potential applications, from symmetric function theory to quantum chemistry studies of atoms, molecules and solids.

The symmetric group Sn has order n!. Its conjugacy classes are labeled by partitions of n. Therefore according to the representation theory of a finite group, the number of inequivalent irreducible representations, over the complex numbers, is equal to the number of partitions of n. Unlike the general situation for finite groups, there is in fact a natural way to parametrize irreducible representations by the same set that parametrizes conjugacy classes, namely by partitions of n or equivalently Young diagrams of size n.

Each such irreducible representation can in fact be realized over the integers (every permutation acting by a matrix with integer coefficients); it can be explicitly constructed by computing the Young symmetrizers acting on a space generated by the Young tableaux of shape given by the Young diagram. The dimension d λ {\displaystyle d_{\lambda }} of the representation that corresponds to the Young diagram λ {\displaystyle \lambda } is given by the hook length formula.

To each irreducible representation ρ we can associate an irreducible character, χρ. To compute χρ(π) where π is a permutation, one can use the combinatorial Murnaghan–Nakayama rule . Note that χρ is constant on conjugacy classes, that is, χρ(π) = χρ−1πσ) for all permutations σ.

Over other fields the situation can become much more complicated. If the field K has characteristic equal to zero or greater than n then by Maschke's theorem the group algebra KSn is semisimple. In these cases the irreducible representations defined over the integers give the complete set of irreducible representations (after reduction modulo the characteristic if necessary).

However, the irreducible representations of the symmetric group are not known in arbitrary characteristic. In this context it is more usual to use the language of modules rather than representations. The representation obtained from an irreducible representation defined over the integers by reducing modulo the characteristic will not in general be irreducible. The modules so constructed are called Specht modules, and every irreducible does arise inside some such module. There are now fewer irreducibles, and although they can be classified they are very poorly understood. For example, even their dimensions are not known in general.

The determination of the irreducible modules for the symmetric group over an arbitrary field is widely regarded as one of the most important open problems in representation theory.

Como se diz symmetric representation em Russo? Tradução de &#39symmetric representation&#39 em Russo